Complexity Trade-offs for Video Coding Using Tree-structured Vector Quantization
نویسندگان
چکیده
Residual vector quantization (RVQ), tree-structured RVQ (TRVQ), and full-search tree-structured RVQ (FSTRVQ) are presented as techniques which exploit the benefit of vector quantization (VQ), while maintaining manageable memory and computational complexity. RVQ provides linear growth in memory and computational complexity with basic codebook size, compared to the exponential growth of full search VQ. TRVQ and FSTRVQ are used to make trade-offs between memory usage, computational resources, and performance, and thus approach the performance of full-search VQ. Our simulations show that TRVQ can provide up to 1.5 db PSNR improvement over RVQ, while FSTRVQ can provide up to 3 db improvement, with corresponding perceptual benefit.
منابع مشابه
Adaptive-search tree-structured residual vector quantization
Full-search vector quantization (VQ) provides optimal results only with high memory and computational cost. We describe the computational and memory requirements of treestructured VQ, residual VQ (RVQ), and tree-structured RVQ. We present multiple-rate, adaptive-search implementations of these VQ structures, and simulation results with video sequences. Tree-structured RVQ provides up to 1.5 db ...
متن کاملA Method to Reduce Effects of Packet Loss in Video Streaming Using Multiple Description Coding
Multiple description (MD) coding has evolved as a promising technique for promoting error resiliency of multimedia system in real-time application programs over error-prone communicational channels. Although multiple description lattice vector quantization (MDCLVQ) is an efficient method for transmitting reliable data in the context of potential error channels, this method doesn’t consider disc...
متن کاملQuantized discrete cosine transform: a combination of DCT and scalar quantization
A typical MPEG-2 video encoder requires that DCT and quantization be performed in most cases. In this paper, we show how to combine these two steps, reducing sunstantially the number of computations. The new nonlinear transform is called the Quantized Discrete Cosine Transform, or QDCT. We also introduce a new method to trade-off the computational complexity and the precision of the QDCT. Altho...
متن کاملVariable-length constrained-storage tree-structured vector quantization
Constrained storage vector quantization, (CSVQ), introduced by Chan and Gersho (1990, 1991) allows for the stagewise design of balanced tree-structured residual vector quantization codebooks with low encoding and storage complexities. On the other hand, it has been established by Makhoul et al. (1985), Riskin et al. (1991), and by Mahesh et al. (see IEEE Trans. Inform. Theory, vol.41, p.917-30,...
متن کاملA Scalable Wavelet Image Coding Scheme Using Multi - Stagepruned Tree - Structured Vector
A hierarchical pruned tree-structured vector quantizer (PTSVQ) employing multi-stage PTSVQ's is introduced to encode image wavelet coeecients. The result is a low-complexity and scalable image coding system. The eeects of non-square selection of the block sizes and normalization on the performance of the system are investigated.
متن کامل